Locally Conservative Algorithms for Flow

نویسنده

  • Mary F. Wheeler
چکیده

Locally mass conservative methods for subsurface ow are presented and applied to the unstable miscible displacement problem arising in porous media. The pressure equation is solved either by the discontinuous Galerkin method or the mixed nite element method. The concentration equation is solved using a higher order Godunov method. Theoretical estimates are given for the approximation of the pressure obtained by the discontinuous Galerkin method. A velocity projection method based on the discontinuous Galerkin method is introduced. Numerical simulations comparing the two methods are presented. 1.1 INTRODUCTION In either surface water or subsurface water environmental quality modeling, the ow and multi-species transport may be solved separately using diierent numerical methods and grids due to diierences in time and length scales involved. For example, in surface water, the ow grid usually needs to incorporate high resolution near land boundaries and should extend into the ocean to avoid spurious boundary eeects. The transport code may only simulate transport over a small portion of the ow domain, and may use much coarser resolution. Therefore, for eecient coupling of ow and transport codes, it is critical to be able to take velocities from an arbitrary ow grid, and project them onto an arbitrary transport grid. For accurate multi-species transport, it is desirable for the velocities to be locally conservative on the transport grid.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Coupling locally conservative methods for single phase flow

This work presents the coupling of two locally conservative methods for elliptic problems: namely, the discontinuous Galerkin method and the mixed finite element method. The couplings can be defined with or without interface Lagrange multipliers. The formulations are shown to be equivalent. Optimal error estimates are given; penalty terms may or may not be included. In addition, the analysis fo...

متن کامل

A Mass Conservative Method for Numerical Modeling of Axisymmetric flow

In this paper, the cell-centered finite volume method (CC-FVM) has been presented to simulate the axisymmetric radial flow toward a pumping well. The model is applied to the unstructured triangular grids which allows to simulate inhomogeneous and complex-shaped domains. Due to the non-orthogonality of the irregular grids, the multipoint flux approximation (MPFA) methods are used to discretize t...

متن کامل

A locally conservative, discontinuous least-squares finite element method for the Stokes equations

Conventional least-squares finite element methods (LSFEMs) for incompressible flows conserve mass only approximately. For some problems, mass loss levels are large and result in unphysical solutions. In this paper we formulate a new, locally conservative LSFEM for the Stokes equations wherein a discrete velocity field is computed that is point-wise divergence free on each element. The central i...

متن کامل

A Fully Conservative Eulerian-Lagrangian Stream-Tube Method for Advection-Diffusion Problems

We present a new method for a two-dimensional linear advection-diffusion problem of a “tracer” within an ambient fluid. The problem should have isolated external sources and sinks, and the bulk fluid flow is assumed to be governed by an elliptic problem approximated by a standard locally conservative scheme. The new method, the fully conservative Eulerian-Lagrangian streamtube method, combines ...

متن کامل

COVERT Based Algorithms for Solving the Generalized Tardiness Flow Shop Problems

Four heuristic algorithms are developed for solving the generalized version of tardiness flow shop problems. We consider the generalized tardiness flow shop model with minimization of the total tardiness as its performance measure. We modify the concept of cost over time (COVERT) for the generalized version of the flow shop tardiness model and employ this concept for developing four algorithms....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999